翻訳と辞書 |
secant method : ウィキペディア英語版 | secant method
In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function ''f''. The secant method can be thought of as a finite difference approximation of Newton's method. However, the method was developed independently of Newton's method, and predated the latter by over 3,000 years. ==The method== The secant method is defined by the recurrence relation : As can be seen from the recurrence relation, the secant method requires two initial values, ''x''0 and ''x''1, which should ideally be chosen to lie close to the root.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「secant method」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|